Guillotine Cut in Approximation Algorithms
نویسندگان
چکیده
The guillotine cut is one of main techniques to design polynomial-time approximation schemes for geometric optimization problems. This article is a mini survey on its history and current developments. ∗Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA. E-mail: {cheng,dzd,jkim,hngo}@cs.umn.edu.
منابع مشابه
A Tale on Guillotine Cut
The guillotine cut is an important tool to design polynomialtime approximation schemes for geometric optimization problems. In this article, we survey its history and recent developments.
متن کاملCutting Out Polygons
In this paper, we present approximation algorithms for the problem of cutting out a convex polygon P with n vertices from another convex polygon Q with m vertices by a sequence of guillotine cuts of smallest total length. Specifically, we give an O(n + m) running time, constant factor approximation algorithm, and an O(n+m) running time, O(log n)-factor approximation algorithm for cutting P out ...
متن کاملOptimization of the retail steel distribution industry
The present work proposes new heuristics and algorithms for the 3D Cutting and Packing class of problems. Specifically the cutting stock problem and a real-world application from the retail steel distribution industry are addressed. The problem being addressed for the retail steel distribution industry is the retail steel cutting problem, which is how to cut steel in order to satisfy the custom...
متن کاملLoading supply vessels by forward checking and a guillotine that doesn't cut
The problem of planning the layout of containers on board supply vessels can be reformulated as the problem of packing a given set of rectangles into a larger rectangle, subject to constraints. A method combining the use of guillotine cuts with forward checking is proposed, and compared to standard forward checking on finite domains. The initial results show that the method has potential for im...
متن کاملCut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کامل